Formal Specification and Verification of JDK’s Identity Hash Map Implementation

نویسندگان

چکیده

Hash maps are a common and important data structure in efficient algorithm implementations. Despite their wide-spread use, real-world implementations not regularly verified. In this paper, we present the first case study of IdentityHashMap class Java JDK. We specified its behavior using Modeling Language (JML) proved correctness for main insertion lookup methods with KeY, semi-interactive theorem prover JML-annotated programs. Furthermore, report how unit testing bounded model checking can be leveraged to find suitable specification more quickly. also investigated where bottlenecks verification hash lie KeY by comparing required automatic proof effort different map draw conclusions choice regarding verifiability.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Web Service Choreography Verification Using Z Formal Specification

Web Service Choreography Description Language (WS-CDL) describes and orchestrates the services interactions among multiple participants. WS-CDL verification is essential since the interactions would lead to mismatches. Existing works verify the messages ordering, the flow of messages, and the expected results from collaborations. In this paper, we present a Z specification of WS-CDL. Besides ve...

متن کامل

Formal Specification, Verification, and Implementation of Fault-Tolerant Systems

Distributed programs are known to be extremely difficult to implement, test, verify, and maintain. This is due in part to the large number of possible unforeseen interactions among components, and to the difficulty of precisely specifying what the programs should accomplish in a formal language that is intuitively clear to the programmers. We discuss here a methodology that has proven itself in...

متن کامل

Design and formal verification of DZMBE+

In this paper, a new broadcast encryption scheme is presented based on threshold secret sharing and secure multiparty computation. This scheme is maintained to be dynamic in that a broadcaster can broadcast a message to any of the dynamic groups of users in the system and it is also fair in the sense that no cheater is able to gain an unfair advantage over other users. Another important feature...

متن کامل

Formal Specification and Automatic Verification

Real-time systems need to react to certain input stimuli within given time bounds. For example, an airbag in a car has to unfold within 300 milliseconds in a crash. There are many embedded safety-critical applications and each requires real-time specification techniques. This textbook introduces three of these techniques, based on logic and automata: Duration Calculus, Timed Automata, and PLC-A...

متن کامل

Formal Verification of Specification Partitioning

This report presents a formal approach to verify models in a system level design environment. It is a first in series of reports that demonstrate how we use this formal approach to refine a given specification down to its cycle-accurate implementation. We formally define models and develop theorems and proofs to show that our well defined refinement algorithms produce functionally equivalent mo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Formal Aspects of Computing

سال: 2023

ISSN: ['1433-299X', '0934-5043']

DOI: https://doi.org/10.1145/3594729